Antimatter as a Frontier of Tractability in Membrane Computing

نویسندگان

  • Daniel Díaz-Pernil
  • Francisco Peña-Cantillana
  • Artiom Alhazov
  • Rudolf Freund
  • Miguel A. Gutiérrez-Naranjo
چکیده

It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the complexity class P (see [6], Th. 2). In this paper, we prove that if such P system model is endowed with antimatter and annihilation rules, then NP problems can be solved. In this way, antimatter is a frontier of tractability in Membrane Computing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformity: uncovering the frontier of parallelism

We summarise some current results for active membrane systems using uniformity below P. Many of the systems we consider are easily to simulate on parallel hardware and provide interesting new directions for the complexity theory of membrane systems as well as those seeking to simulate membrane systems. 1 Familiar frontiers The majority of complexity results to date in membrane systems (also kno...

متن کامل

Cold antihydrogen: a new frontier in fundamental physics.

The year 2002 heralded a breakthrough in antimatter research when the first low energy antihydrogen atoms were produced. Antimatter has inspired both science and fiction writers for many years, but detailed studies have until now eluded science. Antimatter is notoriously difficult to study as it does not readily occur in nature, even though our current understanding of the laws of physics have ...

متن کامل

Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions

Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from CAs, little was known about whether polynomialtime solv...

متن کامل

Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability

An extension of the CSP optimization framework tailored to identify fair solutions to instances involving multiple optimization functions is studied. Two settings are considered, based on the maximization of the minimum value over all the given functions (MAX-MIN approach) and on its lexicographical refinement where, over all solutions maximizing the minimum value, those maximizing the second m...

متن کامل

On the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3

In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 134  شماره 

صفحات  -

تاریخ انتشار 2014